Computing the Shortest Essential Cycle
نویسندگان
چکیده
An essential cycle on a surface is a simple cycle that cannot be continuously deformed to a point or a single boundary. We describe algorithms to compute the shortest essential cycle in an orientable combinatorial surface in O(n2 log n) time, or in O(n log n) time when both the genus and number of boundaries are fixed. Our results correct an error in a paper of Erickson and Har-Peled [DCG 2004].
منابع مشابه
A Novel Method for VANET Improvement using Cloud Computing
In this paper, we present a novel algorithm for VANET using cloud computing. We accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. Each car or node is considered a Client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...
متن کاملMinimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths
Let G be an n-node simple directed planar graph with nonnegative edge weights. We study the fundamental problems of computing (1) a global cut of Gwith minimum weight and (2) a cycle of G with minimum weight. The best previously known algorithm for the former problem, running in O(n log n) time, can be obtained from the algorithm of Łącki, Nussbaum, Sankowski, and Wulff-Nilsen for single-source...
متن کاملLayered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerning graphs, viz. layer oriented traversal and computing sets of Hamiltonian paths. In the rst case, we are even able to abstract to the very general setting of Kleene algebras. Applications include reachability and a shortest path problem as well as topological sorting, cycle detection and nding m...
متن کاملPath Problems in Temporal Graphs
Shortest path is a fundamental graph problem with numerous applications. However, the concept of classic shortest path is insufficient or even flawed in a temporal graph, as the temporal information determines the order of activities along any path. In this paper, we show the shortcomings of classic shortest path in a temporal graph, and study various concepts of “shortest” path for temporal gr...
متن کاملEconomic, Social and Environmental Assessment of Electricity Generation from Renewable and Gas Technologies
Growing demand for electricity and the reduction of fossil fuels have made it essential to consider alternative and renewable energy sources, such as solar and wind, to generate electricity. In this paper, by computing levelized output energy cost and levelized cost of electricity, the prices of electricity generated from the different combined cycle, wind, and photovoltaic power plants are com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 44 شماره
صفحات -
تاریخ انتشار 2010